Finite-State Rule Deduction for Parsing Non-Constituent Coordination
نویسندگان
چکیده
In this paper, we present a finite-state approach to constituency and therewith an analysis of coordination phenomena involving so-called non-constituents. We show that non-constituents can be seen as parts of fully-fledged constituents and therefore be coordinated in the same way. We have implemented an algorithm based on finite state automata that generates an LFG grammar assigning valid analyses to non-constituent coordination structures in the German language.
منابع مشابه
Coordination in an Axiomatic Grammar
For some time there has been interest in the idea of parsing as deduction. Here we present a grammat i cal tbrmalism, 'Axiomatic G r a m m a r ' , which is based upon a small number of linguistically motivated ax-toms and deduction rules. Each axiom or rule combines a 'category ' with a string of words to form a further category. This contrasts with the usual 'trees t ructure ' approach to synt...
متن کاملGeneric rules and non-constituent coordination
We present a metagrammatical formalism, generic rules, to give a default interpretation to grammar rules. Our formalism introduces a process of dynamic binding interfacing the level of pure grammatical knowledge representation and the parsing level. We present an approach to non-constituent coordination within categorial grammars, and reformulate it as a generic rule. This reformulation is cont...
متن کاملA Language-Independent Shallow-Parser Compiler
We present a rule−based shallow− parser compiler, which allows to generate a robust shallow−parser for any language, even in the absence of training data, by resorting to a very limited number of rules which aim at identifying constituent boundaries. We contrast our approach to other approaches used for shallow−parsing (i.e. finite−state and probabilistic methods). We present an evaluation of o...
متن کاملNon-Constituent Coordination: Theory And Practice
Despite the large amount of theoretical work done on non-constituent coordination during the last two decades, many computational systems still treat coordination using adapted parsing strategies, in a similar fashion to the SYSCONJ system developed for ATNs. This paper reviews the theoretical literature, and shows why many of the theoretical accounts actually have worse coverage than accounts ...
متن کاملStatistical recursive finite state machine parsing for speech understanding
In this paper, a statistical framework for semantic parsing is described. The statistical model uses two information sources to disambiguate between rules: rule weights that capture vertical relationships in the parse tree, and concept n-grams that capture horizontal relationships. Rule design consists of simple local mapping rules that non-experts can write, and the rules are implemented as we...
متن کامل